FORMAL LANGUAGES: ORIGIN AND DIRECTIONSGREIBACH SA.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 66-90; BIBL. 7 P.Conference Paper

A NOTE ON NSPACE (IOG₂N) AND SUBSTITUTION.GREIBACH SA.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 2; PP. 127-132; BIBL. 9 REF.Article

REMARKS ON THE COMPLEXITY OF NONDETERMINISTIC COUNTER LANGUAGES.GREIBACH SA.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 4; PP. 269-288; BIBL. 17 REF.Article

ERASABLE CONTEXT-FREE LANGUAGES.GREIBACH SA.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 29; NO 4; PP. 301-326; BIBL. 1 P.Article

ONE COUNTER LANGUAGES AND THE CHEVRON OPERATIONGREIBACH SA.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 2; PP. 189-194; ABS. FRE; BIBL. 12 REF.Article

HIERARCHY THEOREMS FOR TWO-WAY FINITE STATE TRANSDUCERSGREIBACH SA.1978; ACTA INFORMAT; DEU; DA. 1978; VOL. 11; NO 1; PP. 89-101; BIBL. 31 REF.Article

VISITS, CROSSES, AND REVERSALS FOR NONDETERMINISTIC OFF-LINE MACHINES.GREIBACH SA.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 2; PP. 174-216; BIBL. 26 REF.Article

THEORY OF PROGRAM STRUCTURES: SCHEMES, SEMANTICS, VERIFICATION.GREIBACH SA.1975; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1975; VOL. 36; PP. (378P.); ISBN 3540074155Serial Issue

JUMP PDA'S AND HIERARCHIES OF DETERMINISTIC CONTEXT-FREE LANGUAGES.GREIBACH SA.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 2; PP. 111-127; BIBL. 1 P.Article

ERASING IN CONTEXT-FREE AFLSGREIBACH SA.1972; INFORM. AND CONTROL.; U.S.A.; DA. 1972; VOL. 21; NO 5; PP. 436-465; BIBL. 1 P.Serial Issue

SUPERDETERMINISTIC PDAS: A SUBCASE WITH A DECIDABLE INCLUSION PROBLEMGREIBACH SA; FRIEDMAN EP.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 675-700; BIBL. 29 REF.Article

THE INDEPENDENCE OF CERTAIN OPERATIONS ON SEMI AFLSBOOK RV; GREIBACH SA.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 369-385; BIBL. 31 REF.Article

A POLYNOMIAL TIME ALGORITHM FOR DECIDING THE EQUIVALENCE PROBLEM FOR 2-TAPE DETERMINISTIC FINITE STATE ACCEPTORSFRIEDMAN EP; GREIBACH SA.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 166-183; BIBL. 9 REF.Article

ON EQUIVALENCE AND SUBCLASS CONTAINMENT PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGESFRIEDMAN EP; GREIBACH SA.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 6; PP. 287-290; BIBL. 21 REF.Article

MONADIC RECURSION SCHEMES: THE EFFECT OF CONSTANTSFRIEDMAN EP; GREIBACH SA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 254-266; BIBL. 18 REF.Article

RESET MACHINESBOOK RV; GREIBACH SA; WRATHALL C et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 256-276; BIBL. 17 REF.Article

MATCHING AND SPANNING IN CERTAIN PLANAR GRAPHSCARLYLE JW; GREIBACH SA; PAZ A et al.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 2; PP. 159-183; BIBL. 17 REF.Article